Triplet-based similarity score for fully multilabeled trees with poly-occurring labels
نویسندگان
چکیده
منابع مشابه
Reconstructing fully-resolved trees from triplet cover distances
It is a classical result that any finite tree with positively weighted edges, and without vertices of degree 2, is uniquely determined by the weighted path distance between each pair of leaves. Moreover, it is possible for a (small) strict subset L of leaf pairs to suffice for reconstructing the tree and its edge weights, given just the distances between the leaf pairs in L. It is known that an...
متن کاملComputing a Consensus of Multilabeled Trees
In this paper we consider two challenging problems that arise in the context of computing a consensus of a collection of multilabeled trees, namely (1) selecting a compatible collection of clusters on a multiset from an ordered list of such clusters and (2) optimally refining high degree vertices in a multilabeled tree. Forming such a consensus is part of an approach to reconstruct the evolutio...
متن کاملDeep Supervised Hashing with Triplet Labels
Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce hashing codes in a separate stage. However, off-the-shelf visual features may not be optimally compatible with the hash code learning procedure, which may result i...
متن کاملManipulating Trees with Hidden Labels
1.1 Languages for Semistructured Data XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15]. Traditional type systems are grounded on mathematical constructions such as cartesian products, disjoint unions, function spaces, and recursive types. The type systems for semistructured data, in contrast, res...
متن کاملLogDet Divergence based Metric Learning using Triplet Labels
Metric learning is fundamental to lots of learning algorithms and it plays significant roles in many applications. In this paper, we present a LogDet divergence based metric learning approach to a learn Mahalanobis distance over input space of the instances. In the proposed model, the most natural constraint triplets are used as the labels of the training samples. Meanwhile, in order to avoid o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2020
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btaa676